Using induction and BDDs to model check invariants
نویسندگان
چکیده
We present an inductive characterization for an invariant to stand in a given finite-state transition system. We show how this characterization can be computed by means of BDD-based operations, without performing a fixpoint iteration over sets of states as the CTL symbolic model checking algorithm does.
منابع مشابه
Model Checking C Programs with Loops via k-Induction and Invariants
We present a novel proof by induction algorithm, which combines k -induction with invariants to model check C programs with bounded and unbounded loops. The k -induction algorithm consists of three cases: in the base case, we aim to find a counterexample with up to k loop unwindings; in the forward condition, we check whether loops have been fully unrolled and that the safety property P holds i...
متن کاملNew Improvement in Interpretation of Gravity Gradient Tensor Data Using Eigenvalues and Invariants: An Application to Blatchford Lake, Northern Canada
Recently, interpretation of causative sources using components of the gravity gradient tensor (GGT) has had a rapid progress. Assuming N as the structural index, components of the gravity vector and gravity gradient tensor have a homogeneity degree of -N and - (N+1), respectively. In this paper, it is shown that the eigenvalues, the first and the second rotational invariants of the GGT (I1 and ...
متن کاملFrom low confidence tools to high confidence results in software verification
ion is a technique that is used to reduce the mathematical model to check; it is intensively used in verification tools. When doing program analysis by either abstract interpretation or by model checking combined with predicate abstraction, it is important that the abstract model really represents all behaviors of the concrete system, otherwise the system may infer false properties. SMT-solving...
متن کاملAbstraction and BDDs Complement SAT-Based BMC in DiVer
ion and BDDs Complement SAT-based BMC in DiVer Aarti Gupta1, Malay Ganai, Chao Wang2, Zijiang Yang1, Pranav Ashar 1 NEC Laboratories America, Princeton, NJ, U.S.A. 2 University of Colorado, Boulder, CO, U.S.A. Abstract. Bounded Model Checking (BMC) based on Boolean Satisfiability (SAT) procedures has recently gained popularity for finding bugs in large designs. However, due to its incompletenes...
متن کاملA Theory of Consistency for Modular Synchronous Systems
We propose a model for modular synchronous systems with combinational dependencies and define consistency using this model. We then show how to derive this model from a modular specification where individual modules are specified as Kripke Structures and give an algorithm to check the system for consistency. We have implemented this algorithm symbolically using BDDs in a tool, SpecCheck. We hav...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997